Total Vertex Irregularity Strength of Circular Ladder and Windmill Graphs
نویسندگان
چکیده
Let ( , ) G V E be a simple graph. For a total labeling { } : 1,2,3,..., V E k ∂ ∪ → the weight of a vertex x is defined as ( ) ( ) ( ). xy E wt x x xy ∈ = ∂ + ∂ ∑ ∂ is called a vertex irregular total k-labeling if for every pair of distinct vertices x and y, ( ) ( ). wt x wt y ≠ . The minimum k for which the graph G has a vertex irregular total k-labeling is called the total vertex irregularity strength of G and is denoted by tvs(G). In this paper we determine the total vertex irregularity strength of circular ladder and windmill graphs.
منابع مشابه
Total vertex irregularity strength of corona product of some graphs
A vertex irregular total k-labeling of a graph G with vertex set V and edge set E is an assignment of positive integer labels {1, 2, ..., k} to both vertices and edges so that the weights calculated at vertices are distinct. The total vertex irregularity strength of G, denoted by tvs(G)is the minimum value of the largest label k over all such irregular assignment. In this paper, we study the to...
متن کاملOn Total Edge Irregularity Strength of Staircase Graphs and Related Graphs
Let G=(V(G),E(G)) be a connected simple undirected graph with non empty vertex set V(G) and edge set E(G). For a positive integer k, by an edge irregular total k-labeling we mean a function f : V(G)UE(G) --> {1,2,...,k} such that for each two edges ab and cd, it follows that f(a)+f(ab)+f(b) is different from f(c)+f(cd)+f(d), i.e. every two edges have distinct weights. The minimum k for which G ...
متن کاملThe irregularity and total irregularity of Eulerian graphs
For a graph G, the irregularity and total irregularity of G are defined as irr(G)=∑_(uv∈E(G))〖|d_G (u)-d_G (v)|〗 and irr_t (G)=1/2 ∑_(u,v∈V(G))〖|d_G (u)-d_G (v)|〗, respectively, where d_G (u) is the degree of vertex u. In this paper, we characterize all connected Eulerian graphs with the second minimum irregularity, the second and third minimum total irregularity value, respectively.
متن کاملThe maximal total irregularity of some connected graphs
The total irregularity of a graph G is defined as 〖irr〗_t (G)=1/2 ∑_(u,v∈V(G))▒〖|d_u-d_v |〗, where d_u denotes the degree of a vertex u∈V(G). In this paper by using the Gini index, we obtain the ordering of the total irregularity index for some classes of connected graphs, with the same number of vertices.
متن کاملOn total vertex irregularity strength of graphs
Martin Bača et al. [2] introduced the problem of determining the total vertex irregularity strengths of graphs. In this paper we discuss how the addition of new edge affect the total vertex irregularity strength.
متن کامل